A Cellular Genetic Algorithm with Self–Adjusting Acceptance Threshold
نویسندگان
چکیده
We present a genetic algorithm (GA) whose population possesses a spatial structure. The GA is formulated as a probabilistic cellular automaton: The individuals are distributed over a connected graph and the genetic operators are applied locally in some neighborhood of each individual. By adding a self–organizing acceptance threshold schedule to the proportionate reproduction operator we can prove that the algorithm converges to the global optimum. First results for a multiple knapsack problem indicate a significant improvement in convergence behavior. The algorithm can be mapped easily onto parallel computers.
منابع مشابه
Robot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملEnhancing Rollover Threshold of an Elliptical Container Based on Binary-coded Genetic Algorithm
In this paper, a method based on binary-coded genetic algorithm is proposed to explore an optimization method, for obtaining an optimal elliptical tank. This optimization method enhances the rollover threshold of a tank vehicle, especially under partial filling conditions. Minimizing the overturning moment imposed on the vehicle due to c.g. height of the liquid load, lateral acceleration and ca...
متن کاملA Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks
In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملAdaptive Neuro Fuzzy Sliding Mode Based Genetic Algorithm Control System to Control of a pH Neutralization Process
In this paper, an adaptive neuro fuzzy sliding mode based genetic algorithm (ANFSGA) controlsystem is proposed for a pH neutralization system. In pH reactors, determination and control of pH isa common problem concerning chemical-based industrial processes due to the non-linearity observedin the titration curve. An ANFSGA control system is designed to overcome the complexity of precisecontrol o...
متن کامل